Degree-associated reconstruction number of graphs
نویسندگان
چکیده
منابع مشابه
Degree-associated reconstruction number of graphs
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of cards. A dacard specifies the degree of the deleted vertex along with the card. The degree-associated reconstruction number drn(G) is the minimum number of dacards that determine G. We show that drn(G) = 2 for almost ...
متن کاملThe degree-associated edge-reconstruction number of disconnected graphs and trees
An edge-card of a graph G is a subgraph formed by deleting an edge. The edge-reconstruction number of a graph G, ern(G), is the minimum number of edge-cards required to determine G up to isomorphism. A da-ecard is an edgecard which also speci es the degree of the deleted edge, that is, the number of edges adjacent to it. The degree-associated edge-reconstruction number, dern(G) is the minimum n...
متن کاملDegree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
An ecard of a graph G is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph G, dern(G), is the minimum number of da-ecards that uniquely determines G. The adversary degree associated edge reconstruction number of a graph G, adern(G), is the minimum number k such that every c...
متن کاملThe adversary degree-associated reconstruction number of double-brooms
A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree-associated reconstruction number adrn(G) is the least k such that every set of k dacards determines G. We determine adrn(Dm,n,p), where the double-broom Dm,n,p with p ≥ 2 is the tree with m + n + p vertices obtained from a path with p vertices by append...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.03.037